Scalable package queries in relational database systems
نویسندگان
چکیده
منابع مشابه
Scalable Package Queries in Relational Database Systems
Traditional database queries define constraints that each tuple in the result must satisfy. This model, albeit computationally efficient, does not support many real-world problems that require result tuples to satisfy constraints collectively, rather than individually. Existing work has focused on applicationand domain-specific approaches. Our goal is to create a universal framework to support ...
متن کاملRankSQL: Supporting Ranking Queries in Relational Database Management Systems
Ranking queries (or top-k queries) are dominant in many emerging applications, e.g., similarity queries in multimedia databases, searching Web databases, middleware, and data mining. The increasing importance of top-k queries warrants an efficient support of ranking in the relational database management system (RDBMS) and has recently gained the attention of the research community. Top-k querie...
متن کاملScalable Numerical SPARQL Queries over Relational Databases
We present an approach for scalable processing of SPARQL queries to RDF views of numerical data stored in relational databases (RDBs). Such queries include numerical expressions, inequalities, comparisons, etc. inside FILTERs. We call such FILTERs numerical expressions and the queries numerical SPARQL queries. For scalable execution of numerical SPARQL queries over RDBs, numerical operators sho...
متن کاملFast and Scalable Relational Division on Database Systems
The Relational Algebra is composed of several operators to assist queries and data manipulation on Relational Databases. The Relational Division operator, particularly, allows simple representations of several queries involving the concept of “for all”, however, the SQL does not have an explicit implementation for it. In this paper, we compare the performance of the best implementation known fo...
متن کاملScalable Public Transportation Queries on the Database
Recent scientific literature focuses on answering Earliest Arrival (EA), Latest Departure (LD) and Shortest Duration (SD) queries in (schedule-based) public transportation networks. Unfortunately, most of the existing solutions operate in main memory, making the proposed methods hard to scale for larger instances and difficult to integrate in a multi-user environment. This work proposes PTLDB (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2016
ISSN: 2150-8097
DOI: 10.14778/2904483.2904489